Mathematical Programming and Metaheuristics for Solving Continuous-Time Scheduling Optimization Problems in Low-Volume Low-Variety Production Systems

نویسندگان

چکیده

Despite prominent scholarly advancements in the field of operations research, limited literature has been reported on mathematical and heuristic approaches for schedule low-volume low-variety production systems. This paper proposes a new approach modeling solving large-scale sequencing scheduling problems Low-Volume Low-variety The proposed non-linear programming models genetic algorithms are subject to time resource constraints, aimed at maximizing number activities completed in-station or intended minimize positive deviation aspiring resources budgets, scenarios where allocated work package must be in-station. compatible with discrete continuous-time found effective characteristics constraints inherent Low-Volume, Low-Variety To validate models, real-world case study center final assembly line private jet aircraft is conducted.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

متن کامل

Heuristics and Metaheuristics for Solving Scheduling Problems

Manufacturing scheduling plays a very important function in successful operation of the production planning and control department of an organization. It also offers a great theoretical challenge to the researchers because of its combinatorial nature. Earlier, researchers emphasized classical optimization methods such as linear programming and branch-and-bound method to solve scheduling problem...

متن کامل

A mathematical programming model for scheduling steelmaking-continuous casting production

This paper presents a mathematical model, based on the just-in-time (JIT) idea, for solving machine con ̄icts in steelmaking-continuous casting (SCC) production scheduling in the computer integrated manufacturing system (CIMS) environment. The model is developed as a non-linear model based on actual production situations, considering both punctual delivery and production operation continuity. It...

متن کامل

A Survey on Metaheuristics for Solving Large Scale Optimization Problems

In recent years, there has been a remarkable improvement in the computing power of computers. As a result, numerous realworld optimization problems in science and engineering, possessing very high dimensions, have appeared. In the research community, they are generally labeled as Large Scale Global Optimization (LSGO) problems. Several Metaheuristics has been proposed to tackle these problems. ...

متن کامل

Solving the continuous flow-shop scheduling problem by metaheuristics

Continuous flow-shop scheduling problems circumscribe an important class of sequencing problems in the field of production planning. The problem considered here is to find a permutation of jobs to be processed sequentially on a number of machines under the restriction that the processing of each job has to be continuous with respect to the objective of minimizing the total processing time (flow...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientia Iranica

سال: 2023

ISSN: ['1026-3098', '2345-3605']

DOI: https://doi.org/10.24200/sci.2023.59998.6542